Adaptive regularized parameter selection based on random projection
نویسندگان
چکیده
منابع مشابه
Random Projection-Based Anderson-Darling Test for Random Fields
In this paper, we present the Anderson-Darling (AD) and Kolmogorov-Smirnov (KS) goodness of fit statistics for stationary and non-stationary random fields. Namely, we adopt an easy-to-apply method based on a random projection of a Hilbert-valued random field onto the real line R, and then, applying the well-known AD and KS goodness of fit tests. We conclude this paper by studying the behavior o...
متن کاملGene selection with guided regularized random forest
The regularized random forest (RRF) was recently proposed for feature selection by building only one ensemble. In RRF the features are evaluated on a part of the training data at each tree node. We derive an upper bound for the number of distinct Gini information gain values in a node, and show that many features can share the same information gain at a node with a small number of instances and...
متن کاملRandom Projection, Margins, Kernels, and Feature-Selection
Random projection is a simple technique that has had a number of applications in algorithm design. In the context of machine learning, it can provide insight into questions such as “why is a learning problem easier if data is separable by a large margin?” and “in what sense is choosing a kernel much like choosing a set of features?” This talk is intended to provide an introduction to random pro...
متن کاملEntropy-based Adaptive Range Parameter Selection for Evolutionary Algorithms
Evolutionary Algorithms are equipped with a range of adjustable parameters, such as crossover and mutation rates which significantly influence the performance of the algorithm. Practitioners usually do not have the knowledge and time to investigate the ideal parameter values before the optimisation process. Furthermore, different parameter values may be optimal for different problems, and even ...
متن کاملMarkov Chain and Adaptive Parameter Selection on Particle Swarm Optimizer
Particle Swarm Optimizer (PSO) is such a complex stochastic process so that analysis on the stochastic behavior of the PSO is not easy. The choosing of parameters plays an important role since it is critical in the performance of PSO. As far as our investigation is concerned, most of the relevant researches are based on computer simulations and few of them are based on theoretical approach. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Global Transitions Proceedings
سال: 2021
ISSN: 2666-285X
DOI: 10.1016/j.gltp.2021.01.018